Some Efficient Solutions to Yao's Millionaire Problem
نویسندگان
چکیده
We present three simple and efficient protocol constructions to solve Yao’s Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted third party and achieves a communication overhead linear in input bit-size with the help of an order preserving function.Moreover, the second construction does not require an apriori input bound and can work on inputs of different bit-sizes. The third construction does not use a third party and, even though, it has a quadratic communication overhead, it is a fairly simple construction.
منابع مشابه
An Efficient and Verifiable Solution to the Millionaire Problem
A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millio...
متن کاملCiphertext Comparison, a New Solution to the Millionaire Problem
A new cryptographic protocol —ciphertext comparison— can compare two ciphertexts without revealing the two encrypted messages. Correctness of the comparison can be publicly verified. This technique provides an efficient and publicly verifiable solution to the famous millionaire problem. It is the first solution to the millionaire problem to output a precise result (the two messages are equal or...
متن کاملA Multi-dimensional Yao’s Millionaire Protocol
Yao introduced the “millionaire problem”, in which two parties want to determine who is richer without disclosing anything else about their wealth. This problem deals with single comparison situation; however, in many applications, one often encounters situations where one wants to make multiple comparisons in an “all-or-nothing” fashion: Alice has an n-dimensional vector A = (a 1; : : : ; an),...
متن کاملSequentially Composable Information Theoretically Secure Oblivious Polynomial Evaluation
Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial P , and a receiver inputs a single value i. At the end of the protocol, the sender learns nothing and the receiver learns P (i). This paper deals with the problem of oblivious polynomial evaluation under an information-theoretical perspective, which is based on recent definitions of Uncondit...
متن کاملOn Secure Two-party Computation
1.1. Secure Two-Party Computation. In essence, secure multiparty computation is the solution to the problem how to compute on private inputs from several parties when we do not trust other parties and we don’t have a central authority who can get inputs, perform computations and give outputs to those that need them. Here we will talk about secure twoparty computation, where Alice, holding xa an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.8063 شماره
صفحات -
تاریخ انتشار 2013